A Nonhomogeneous Markov Process for the Estimation of Gaussian Random Fields with Nonlinear Observations
نویسندگان
چکیده
منابع مشابه
Gaussian Process Random Fields
Gaussian processes have been successful in both supervised and unsupervised machine learning tasks, but their computational complexity has constrained practical applications. We introduce a new approximation for large-scale Gaussian processes, the Gaussian Process Random Field (GPRF), in which local GPs are coupled via pairwise potentials. The GPRF likelihood is a simple, tractable, and paralle...
متن کاملSubset Selection for Gaussian Markov Random Fields
Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobserved variables. We first show that finding an exact solution is NP-hard even for a restricted class of Gaussian Markov random fields, called Gaussian free fields, which arise in semi-supervised learning and computer ...
متن کاملMaximum a posteriori estimation for Markov chains based on Gaussian Markov random fields
In this paper, we present a Gaussian Markov random field (GMRF) model for the transition matrices (TMs) of Markov chains (MCs) by assuming the existence of a neighborhood relationship between states, and develop the maximum a posteriori (MAP) estimators under different observation conditions. Unlike earlier work on TM estimation, our method can make full use of the similarity between different ...
متن کاملEfficient Parallel Estimation for Markov Random Fields
We present a new , deterministic, distributed MAPes timation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The al gorithm has been applied to segmentation problems in computer vision and its performance compared with stochastic algorithms. The experiments show that Local HCF finds better estimates than stochas tic algorithms with much less computation.
متن کاملApproximating Hidden Gaussian Markov Random Fields
This paper discusses how to construct approximations to a unimodal hidden Gaussian Markov random field on a graph of dimensionnwhen the likelihood consists of mutually independent data. We demonstrate that a class of non-Gaussian approximations can be constructed for a wide range of likelihood models. They have the appealing properties that exact samples can be drawn from them, the normalisatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1991
ISSN: 0091-1798
DOI: 10.1214/aop/1176990228